Sorting and Searching / Subarray Sums II

#include <bits/stdc++.h>
using namespace std;

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using isize = ptrdiff_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using usize = size_t;
using f32 = float_t;
using f64 = double_t;

inline constexpr i32 Modulus = 1e9 + 7;

int main(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    usize n;
    cin >> n;

    i64 target;
    cin >> target;

    vector<i32> nums(n);
    for (usize index = 0; index < n; index += 1)
    {
        cin >> nums[index];
    }

    usize count = 0;
    i64 prefixSum = 0;
    map<i64, usize> prefixSumCounts;
    prefixSumCounts[0] = 1;

    for (usize index = 0; index < n; index += 1)
    {
        prefixSum += nums[index];
        count += prefixSumCounts[prefixSum - target];
        prefixSumCounts[prefixSum] += 1;
    }

    cout << count;

    return 0;
}